Small Universal Circular Post Machines
نویسندگان
چکیده
We consider a new kind of machines with a circular tape and moving in one direction only, so-called Circular Post machines. Using 2-tag systems we construct some small universal machines of this kind.
منابع مشابه
Nine Universal Circular Post Machines
We consider a new kind of computational device like Turing machine, so-called circular Post machines with a circular tape and moving in one direction only, introduced recently by the second and the third authors. Using 2-tag systems we construct new nine small universal machines of this kind.
متن کاملSmall Weakly Universal Turing Machines
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110 and are currently the smallest known weakly universal Turing machines. Despite their small size these machines are efficient polynomial...
متن کاملSmall fast universal Turing machines
We present a number of time-efficient small universal Turing machines. We show that there exists deterministic polynomial time universal Turing machines with state-symbol products of (3, 11), (5, 7), (6, 6), (7, 5) and (8, 4). These machines are the smallest known universal Turing machines that simulate TMs in polynomial time.
متن کاملRemarks on the computational complexity of small universal Turing machines
This paper surveys some topics in the area of small universal Turing machines and tag systems. In particular we focus on recent results concerning the computational complexity of such machines.
متن کاملFour Small Universal Turing Machines
We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known universal Turing machines with 5, 4, 3 and 2-symbols respectively. Our 5-symbol machine uses the same number of instructions (22) as the smallest known universal Turing machin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 9 شماره
صفحات -
تاریخ انتشار 2001